Recognition of tractable satisfiability problems through balanced polynomial representations
نویسندگان
چکیده
منابع مشابه
A polynomial recognition algorithm for balanced matrices
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti, Cornuéjols and Rao [9], and Conforti, Cornuéjols, Kapoor and Vušković [6], provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduce...
متن کاملWhat makes normalized weighted satisfiability tractable
We consider the weighted antimonotone and the weighted monotone satisfiability problems on normalized circuits of depth at most t ≥ 2, abbreviated wsat−[t] and wsat[t], respectively. These problems model the weighted satisfiability of antimonotone and monotone propositional formulas (including weighted anitmonoone/monotone cnf-sat) in a natural way, and serve as the canonical problems in the de...
متن کاملThe Reduction of Satisfiability Problems into 2CNF Satisfiability Problems
Many search techniques are successful in finding solutions to NP-Complete problems in polynomial-time. The search time can be improved upon by sub-dividing the variables and clauses. This sub-division generates data pairs in conjunctive normal form. Then, by using the Two-SAT algorithm, the new subset of data is solved in linear-time.
متن کاملTractable Optimization Problems through Hypergraph-Based Structural Restrictions
Several variants of the Constraint Satisfaction Problem have been proposed and investigated in the literature for modelling those scenarios where solutions are associated with some given costs. Within these frameworks computing an optimal solution is an NP-hard problem in general; yet, when restricted over classes of instances whose constraint interactions can be modelled via (nearly-)acyclic g...
متن کاملBalanced Judicious Bipartition is Fixed-Parameter Tractable
The family of judicious partitioning problems, introduced by Bollobás and Scott to the field of extremal combinatorics, has been extensively studied from a structural point of view for over two decades. This rich realm of problems aims to counterbalance the objectives of classical partitioning problems such as Min Cut, Min Bisection and Max Cut. While these classical problems focus solely on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00135-3